Journalism cannot solve journalism’s problems

Deterministic moles cannot solve liveness

We examine the conjecture that no polynomial can upper bound the increase in the number of states when a one-way nondeterministic finite automaton (1nfa) is converted into an equivalent two-way deterministic finite automaton (2dfa). We study the problem of liveness, which admits 1nfas of polynomial size and is known to defy 2dfas of polynomial size if and only if the conjecture is true. We focu...

Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time

1 / 4 Abstract—This article discusses ability of Linear Programming models to be used as solvers of NP-complete problems. Integer Linear Programming is known as NP-complete problem, but non-integer Linear Programming problems can be solved in polynomial time, what places them in P class. During past three years there appeared some articles using LP to solve NP-complete problems. This methods us...

Are there ecological problems that technology cannot solve? Water scarcity and dams, climate change and biofuels

This paper illustrates through a comparative case study how contemporary engineers working on a technological response to climate change—biofuel production—continue to be guided by traditional ethical and historical principles of efficiency and growth in spite of the uniqueness of climate change as a problem unbounded globally in space and time. The comparative study reveals that in the past en...

Why LP Cannot Solve Large Instances of NP-complete Problems in Polynomial Time

— Using an approach that seems to be patterned after that of Yannakakis, Hofman argues that an NP-complete problem cannot be formulated as a polynomial bounded-sized linear programming problem. He then goes on to propose a " construct " that he claims to be a " counterexample " to recently published linear programming formulations of the Traveling Salesman Problem (TSP) and the Quadratic Assign...

What Problems Must Criminalistics Solve